package com.huawei.leetcode;

public class Code704 {

    public int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;

        while (true) {
            if (left > right) {
                break;
            }
            int mid = (left + right) >>> 1;
            if (nums[mid] < target) {
                left = mid + 1;
            } else if (nums[mid] > target) {
                right = mid - 1;
            } else {
                return mid;
            }
        }
        return -1;
    }
}
